Non-Stanley Bounds for Network Reliability
نویسندگان
چکیده
Suppose that each edge of a connected graph G of order n is independently operational with probability p; the reliability of G is the probability that the operational edges form a spanning connected subgraph. A useful expansion of the reliability is as pn-1 5dj=0 Hi(l — p ) i , and the Ball-Provan method for bounding reliability relies on Stanley's combinatorial bounds for the H-vectors of shellable complexes. We prove some new bounds here for the H-vectors arising from graphs, and the results here shed light on the problem of characterizing the H-vectors of matroids.
منابع مشابه
Fast computation of bounds for two-terminal network reliability
In this paper, an algorithm for the fast computation of network reliability bounds is proposed. The evaluation of the network reliability is an intractable problem for very large networks, and hence approximate solutions based on reliability bounds have assumed importance. The proposed bounds computation algorithm is based on an efficient BDD representation of the reliability graph model and a ...
متن کاملBounds on Reliability of Parallel Computer Interconnection Systems
The evaluation of residual reliability of large sized parallel computer interconnection systems is not practicable with the existing methods. Under such conditions, one must go for approximation techniques which provide the upper bound and lower bound on this reliability. In this context, a new approximation method for providing bounds on residual reliability is proposed here. The proposed meth...
متن کاملLower Bounds for Two-Terminal Network Reliability
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probability that two specified communication centers can communicate. A standard model of a network is a graph in which nodes represent communications centers and edges represent links between communication centers. Edges are assumed to have statistically independent probabilities of failing and nodes ar...
متن کاملThe Evaluations on Lower Bounds of All-Terminal Reliability by Arc-Packings for General Networks
All-terminal reliability is one of the measurements to evaluate the reliability for network systems. Since it may need exponential time of the network size to compute the exact value of all-terminal reliability, it is important to calculate its tight approximate value, especially its lower bound, at a moderate calculation time. Ramanathan and Colbourn have proposed approaches for lower bounds o...
متن کاملDifferentiated reliability (DiR) in WDM rings without wavelength converters
The concept of Differentiated Reliability (DiR) was recently introduced by the authors to provide multiple reliability degrees (or classes) at the same network layer using a common protection mechanism, e.g., path switching. According to the DiR concept, each connection at the layer under consideration is guaranteed a minimum reliability degree, defined as the Maximum Failure Probability allowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993